- If A is an algorithm for solving a particular class of problems and n is a measure of the size of a particular problem in this class, then fA(n), the complexity function, is that function of n giving an upper bound on the maximum number of basic operations that algorithm A has to perform to solve any problem of size n.Forexample, n might be the number of records in a file and fA(n) the maximum number of comparisons required to sort the file.; 設A是解某特殊類型問題的算法,n是表示該類問題中某一問題規(guī)模大小的一個參數(shù),則fA(n)是其復雜性函數(shù),表示用算法A解規(guī)模為n的此類問題時基本運算數(shù)目的上限。例如,n是一個文件中記錄的個數(shù), fA(n)表示對此文件進行分類時所需的比較運算的最大數(shù)目。
下載手機詞典可隨時隨地查詞查翻譯